On the Behavior of Lifo Preemptive Resume Queues in Heavy Traffic
نویسنده
چکیده
This paper studies heavy traffic behavior of a G/G/1 last-in-first-out (LIFO) preemptive resume queue, by extending the techniques developed in Limic (1999). The queue length process exhibits a perhaps unexpected heavy traffic behavior. The diffusion limit depends on the type of arrivals (and services) in a fairly intricate way, related to the Wiener-Hopf factorization for random walks.
منابع مشابه
Representing Workloads in GI/G/1 Queues Through the Preemptive-Resume LIFO Queue Discipline
We give in this paper a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: We study the long-run “state” behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, tog...
متن کاملSOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملSome Time-Dependent Properties of Symmetric M/G/1 Queues
Consider an M/G/1 queue which is idle at time 0. The number of customers sampled at an independent exponential time is shown to have the same geometric distribution under the preemptive resume last in first out (LIFO) and the processor sharing (PS) disciplines. Hence, the marginal distribution of the queue length at any time is identical for both disciplines. We then give a detailed analysis of...
متن کاملOptimal incentive-compatible pricing for M/G/1 queues
This paper extends previous research on congested service facilities to generalized service distributions, a significant extension given the limitations of exponential distributions for networked computer job modeling. Building on the framework first presented in Mendelson and Whang (1990), we present fundamental theorems for non-priority M/G/1 queues, nonpreemptive M/G/1 queues, and preemptive...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کامل